Group Undeniable Signatures

نویسنده

  • YUH-DAUH LYUU
چکیده

A group undeniable signature scheme is proposed in which each group member can sign on behalf of the group without revealing his or her identity and the verification of a signature can only be done with the cooperation of the group manager. For business applications, group undeniable signatures can be used to validate price lists, press release or digital contracts when the signatures are commercially sensitive or valuable to a competitor. If a group is falsely accused of having signed a particular signature, the manager should have the ability to prove his innocence. In case of a later dispute, the manager can track down which member signed the signature. Our scheme can be proven to be unforgeable, signature-simulatable and coalition-resistant. The confirmation and denial protocols are also zero-knowledge. Furthermore, the time, space and communication complexity are independent of the group size. Key-Words: Group signature, Undeniable signature, Signature of knowledge, Unforgeability, Coalition resistance.

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Convertible Group Undeniable Signatures

Group undeniable signatures are like ordinary group signatures except that verifying signatures needs the help of the group manager. In this paper, we propose a convertible group undeniable signature scheme in which the group manager can turn all or selective signatures, which are originally group undeniable signatures, into ordinary group signatures without compromising security of the secret ...

متن کامل

Short Convertible Undeniable Signature From Pairing

Undeniable signatures, introduced by Chaum and van Antwerpen, require a verifier to interact with the signer to verify a signature, and hence allow the signer to control the verifiability of his signatures. Convertible undeniable signatures allow the signer to convert undeniable signatures into ordinary signatures. In this paper we propose some extended variants of the famous DiffieHellman assu...

متن کامل

Short undeniable SignatureS: deSign, analySiS, and applicationS

Digital signatures are one of the main achievements of public-key cryptography and constitute a fundamental tool to ensure data authentication. Although their universal verifiability has the advantage to facilitate their verification by the recipient, this property may have undesirable consequences when dealing with sensitive and private information. Motivated by such considerations, undeniable...

متن کامل

Gradually Convertible Undeniable Signatures (Michels-Petersen-Horster Convertible Undeniable Signatures Revisited)

In 1990, Boyar, Chaum, Damg̊ard and Pedersen introduced convertible undeniable signatures which limit the self-authenticating property of digital signatures but can be converted by the signer to ordinary signatures. Michels, Petersen and Horster presented, in 1996, an attack on the El Gamal-based seminal scheme of Boyar et al. and proposed a repaired version without formal security analysis. In ...

متن کامل

Practical Fair Anonymous Undeniable Signatures

We present a new model for undeniable signatures: fair-anonymous undeniable signatures. This protocol can not only preserve the privacy of the signer (i.e. anonymity) but also track the illegal utilization of the valid signatures. In addition, our model prevents the trusted centre from forging a valid signature for any signer. Keywords—Cryptography, Fair Anonymity, Information Security, RSA Sig...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2002